Approximate Minimum 2-Connected Subgraphs in Weighted Planar Graphs
نویسندگان
چکیده
We consider the problems of finding the minimum-weight 2-connected spanning subgraph in edge-weighted planar graphs and its variations. We first give a PTAS for the problem of finding minimum-weight 2-edge-connected spanning subgraphs where duplicate edges are allowed. Then we present a new greedy spanner construction for edge-weighted planar graphs. From this we derive quasi-polynomial time approximation schemes for the problems of finding the lightest 2-edge-connected or biconnected spanning subgraph in such graphs. We also design efficient approximation schemes for the variant where vertices have non-uniform (1 or 2) connectivity constraints.
منابع مشابه
Approximation Schemes for Minimum 2-Connected Spanning Subgraphs in Weighted Planar Graphs
We present new approximation schemes for various classical problems of finding the minimum-weight spanning subgraph in edgeweighted undirected planar graphs that are resistant to edge or vertex removal. We first give a PTAS for the problem of finding minimum-weight 2-edge-connected spanning subgraphs where duplicate edges are allowed. Then we present a new greedy spanner construction for edge-w...
متن کاملMinimum Weight 2-Edge-Connected Spanning Subgraphs in Planar Graphs
We present a linear time algorithm exactly solving the 2-edge connected spanning subgraph (2-ECSS) problem in a graph of bounded treewidth. Using this with Klein’s diameter reduction technique [15], we find a linear time PTAS for the problem in unweighted planar graphs, and the first PTAS for the problem in weighted planar graphs.
متن کاملSeries-parallel subgraphs of planar graphs
In this paper we show that every 3-connected (3-edge-connected) planar graph contains a 2-connected (respectively, 2-edge-connected) spanning partial 2-tree (seriesparallel) graph. In contrast, a recent result by [4] implies that not all 3-connected graphs contain 2-edge-connected series-parallel spanning subgraphs.
متن کاملTOTAL DOMINATION POLYNOMIAL OF GRAPHS FROM PRIMARY SUBGRAPHS
Let $G = (V, E)$ be a simple graph of order $n$. The total dominating set is a subset $D$ of $V$ that every vertex of $V$ is adjacent to some vertices of $D$. The total domination number of $G$ is equal to minimum cardinality of total dominating set in $G$ and denoted by $gamma_t(G)$. The total domination polynomial of $G$ is the polynomial $D_t(G,x)=sum d_t(G,i)$, where $d_t(G,i)$ is the numbe...
متن کاملSome new light subgraphs in the 1-planar graphs
A graph is 1-planar if it can be drawn in the plane such that every edge crosses at most one other edge. A connected graph H is strongly light in a family of graphs G, if there exists a constant λ, such that every graph G in G contains a subgraph K isomorphic to H with degG(v) ≤ λ for all v ∈ V(K). In this paper, we present some strongly light subgraphs in the family of 1-planar graphs with min...
متن کامل